On the fundamental group of an almost-acyclic 2-complex
نویسندگان
چکیده
منابع مشابه
an investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation
the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...
Recognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملOn the irreducibility of the complex specialization of the representation of the Hecke algebra of the complex reflection group $G_7$
We consider a 2-dimensional representation of the Hecke algebra $H(G_7, u)$, where $G_7$ is the complex reflection group and $u$ is the set of indeterminates $u = (x_1,x_2,y_1,y_2,y_3,z_1,z_2,z_3)$. After specializing the indetrminates to non zero complex numbers, we then determine a necessary and sufficient condition that guarantees the irreducibility of the complex specialization of the repre...
متن کاملThe Fundamental Group of Random 2-complexes
In this article we find the threshold for simple connectivity of the random 2dimensional simplicial complexes Y (n, p) introduced by Linial and Meshulam [10] to be roughly p = n−1/2. One motivation for this is continuing the thread of probabilistic topology initiated by Linial and Meshulam [10], and even earlier by Erdős and Rényi [3]. (Other recent work concerning the topology of random simpli...
متن کاملSatisfiability of Acyclic and Almost Acyclic CNF Formulas
We show that the SATISFIABILITY (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution where each resolvent is a subset of a parent clause. We extend this class to CNF formulas for which this type of DavisPutnam resolution still applies and show that testing membership in this class is NP-complete. We compare...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1981
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500006416